On contiguous and non-contiguous parallel task scheduling

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On contiguous and non-contiguous parallel task scheduling

In this paper we study differences between contiguous and non-contiguous parallel task schedules. Parallel tasks can be executed on more than one processor simultaneously. In the contiguous schedules indices of the processors assigned to a task must be a sequence of consecutive numbers. In the non-contiguous schedules processor indices may be arbitrary. Nonpreemptive schedules are considered. G...

متن کامل

Scheduling Non-Contiguous Tape Retrievals

Large data installations normally archive relatively inactive data to a near-line tape library. The tape library performs reasonably well for sequential-access retrieval workloads. However, if the retrieval access slices across multiple data sets, or makes retrievals from scattered portions of a large data set, then the performance can suffer

متن کامل

Non-contiguous spinal tuberculosis.

DESCRIPTION A 26-year-old-man of Indian descent was referred to our rheumatology unit with 6 months of lower-back pain. He had lived in the UK for 5 years, travelling intermittently to holiday in India. His general practitioner detected a C-reactive protein of 55 mg/l and erythrocyte sedimentation rate of 95 mm/h and referred with a possible ‘spondyloarthritis’. The patient gave a history of ba...

متن کامل

Non-Contiguous Tree Parsing

Pairing structural descriptions in MT, syntax-semantics interfaces and so on becomes more difficult the more structurally different are the languages involved; there is, implicitly or explicitly, a process of ‘tree parsing’, where a structural description is split into component smaller trees for transfer rules to be applied. Recent work has looked at the construction of transfer rules, using b...

متن کامل

On Coding Non-Contiguous Letter Combinations

Starting from the hypothesis that printed word identification initially involves the parallel mapping of visual features onto location-specific letter identities, we analyze the type of information that would be involved in optimally mapping this location-specific orthographic code onto a location-invariant lexical code. We assume that some intermediate level of coding exists between individual...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Scheduling

سال: 2015

ISSN: 1094-6136,1099-1425

DOI: 10.1007/s10951-015-0427-z